H-Kernels in Infinite Digraphs

نویسندگان

  • Hortensia Galeana-Sánchez
  • Rocio Sanchez-Lopez
چکیده

Let H be a digraph possibly with loops and D a digraph (possibly infinite) without loops whose arcs are coloured with the vertices of H (D is an H-coloured digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively. A directed walk or a directed pathW in D is an H-walk or an H-path if and only if the consecutive colors encountered onW form a directed walk in H. A set N ⊆ V(D) is an H-kernel if for every pair of different vertices in N there is no H-path between them, and for every vertex u ∈ V(D)\N there exists an H-path in D from u to N. Linek and Sands introduced the concept of H-walk and this concept was later used by several authors. In particular, Galeana-Sánchez and Delgado-Escalante used the concept of H-walk in order to introduce the concept of H-kernel, which generalizes the concepts of kernel and kernel by monochromatic paths. Let D be an arc-coloured digraph. In 2009 Galeana-Sánchez introduced the concept of color-class digraph of D, denoted by CC(D), as follows: the vertices of the color-class digraph are the colors represented in the arcs of D, and (i, j) ∈ A(CC(D)) if and only if there exist two arcs namely (u,v) and (v,w) in D such that (u,v) has color i and (v,w) has color j. Since V(CC(D)) ⊆ V(H), the main question is: What structural properties of CC(D), with respect toH, imply thatD has anH-kernel? Suppose thatD has no infinite outward H-path. In this paper we prove that if CC(D) ⊆ H, then D has an H-kernel. We also prove that if there exists a partition (V1,V2) of V(CC(D)) such that: (1) CC(D)[Vi] ⊆ H[Vi] for each i ∈ {1,2}, (2) if (u,v) ∈ A(CC(D)) for some u ∈ Vi and for some v ∈ Vj, with i ̸= j and i, j ∈ {1,2}, then (u,v) / ∈ A(H), and (3) D has no Vi-colored infinite outward H-path for each i ∈ {1,2}. Then D has an H-kernel. Several previous results are generalized. H. Galeana-Sánchez, Rocı́o Sánchez-López Instituto de Matemáticas, UNAM Ciudad Universitaria, Circuito Exterior 04510 México, D.F., México E-mail: [email protected] R. Sánchez-López E-mail: [email protected] 2 Hortensia Galeana-Sánchez, Rocı́o Sánchez-López

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the existence of (k, l)-kernels in infinite digraphs: A survey

Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent (if u, v ∈ N , u 6= v, then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l) set of vertices. A k-kernel is a (k, k− 1)-kernel. This work is a survey of results proving sufficient conditions for the exist...

متن کامل

Combinatorial game theory foundations applied to digraph kernels

Known complexity facts: the decision problem of the existence of a kernel in a digraph G = (V,E) is NP-complete; if all of the cycles of G have even length, then G has a kernel; and the question of the number of kernels is #P-complete even for this restricted class of digraphs. In the opposite direction, we construct game theory tools, of independent interest, concerning strategies in the prese...

متن کامل

Some sufficient conditions for the existence of kernels in infinite digraphs

A kernel N of a digraph D is an independent set of vertices of D such that for every w ∈ V (D)− N there exists an arc from w to N . If every induced subdigraph of D has a kernel, D is said to be a kernel perfect digraph. D is called a critical kernel imperfect digraph when D has no kernel but every proper induced subdigraph of D has a kernel. If F is a set of arcs of D, a semikernel modulo F of...

متن کامل

On the existence of kernels and h-kernels in directed graphs

Galeana-Sanchez, H., On the existence of kernels and h-kernels in directed graphs, Discrete Mathematics 110 (1992) 2.51-255. A directed graph D with vertex set V is called cyclically h-partite (h > 2) provided one can partition V = V, + V, +. . + V,_, so that if (u, u) is an arc of D then u E V,, and u E v+, (notation mod h). In this communication we obtain a characterization of cyclically h-pa...

متن کامل

H-kernels in the D-join

In [8] it was introduced the concept of H-kernel, which generalizes the concepts of kernel and kernel by monochromatic paths. In this paper we prove necessary and sufficient conditions for the existence of H-kernels in the D-join of digraphs and consequently we will give a sufficient condition for D-join to be H-kernel perfect.

متن کامل

On (k, l)-kernels of special superdigraphs of Pm and Cm

The concept of (k, l)-kernels of digraphs was introduced in [2]. Next, H. Galeana-Sanchez [?] proved a sufficient condition for a digraph to have a (k, l)-kernel. The result generalizes the well-known theorem of P. Duchet and it is formulated in terms of symmetric pairs of arcs. Our aim is to give necessary and sufficient conditions for digraphs without symmetric pairs of arcs to have a (k, l)-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2013